A Short Introduction to String Re-writing Kernel
نویسنده
چکیده
This is a brief introduction to string re-writing kernel (SRK) proposed by Bu, Li, & Zhu in [1, 2]. SRK measures the similarity between two re-writings of strings. SRK can capture the lexical and structural similarity between two pairs of sentences for paraphrasing, question answering, and short text conversation. It might be intractable to compute a generic SRK; Bu et al. further propose a sub-class of SRK, called kb-SRK, which can be computed efficiently. Experimental results show that the use of kb-SRK can achieve results comparable with the state-of-the-art methods on paraphrase identification and recognizing textual entailment. Their paper received the best student paper award at ACL 2012.
منابع مشابه
An Introduction to String Re-Writing Kernel
Learning for sentence re-writing is a fundamental task in natural language processing and information retrieval. In this paper, we propose a new class of kernel functions, referred to as string rewriting kernel, to address the problem. A string re-writing kernel measures the similarity between two pairs of strings. It can capture the lexical and structural similarity between sentence pairs with...
متن کاملString Re-writing Kernel
Learning for sentence re-writing is a fundamental task in natural language processing and information retrieval. In this paper, we propose a new class of kernel functions, referred to as string re-writing kernel, to address the problem. A string re-writing kernel measures the similarity between two pairs of strings, each pair representing re-writing of a string. It can capture the lexical and s...
متن کاملTracking System with Re-identification Using a RGB String Kernel
People re-identification consists to identify a person which comes back in a scene where it has been previously detected. This key problem in visual surveillance applications may concern single or multi camera systems. Features encoding each person should be rich enough to provide an efficient re-identification while being sufficiently robust to remain significant through the different phenomen...
متن کاملString Kernels , Fisher Kernels
In this paper we show how the generation of documents can be thought of as a k-stage Markov process, which leads to a Fisher kernel from which the n-gram and string kernels can be reconstructed. The Fisher kernel view gives a more exible insight into the string kernel and suggests how it can be parametrised in a way that re-ects the statistics of the training corpus. Furthermore, the prob-abili...
متن کاملString Kernels, Fisher Kernels and Finite State Automata
In this paper we show how the generation of documents can be thought of as a k-stage Markov process, which leads to a Fisher kernel from which the n-gram and string kernels can be re-constructed. The Fisher kernel view gives a more flexible insight into the string kernel and suggests how it can be parametrised in a way that reflects the statistics of the training corpus. Furthermore, the probab...
متن کامل